Theoretical foundations of dynamic program slicing
نویسندگان
چکیده
منابع مشابه
Theoretical foundations of dynamic program slicing
This paper presents a theory of dynamic slicing, which reveals that the relationship between static and dynamic slicing is more subtle than previously thought. The definitions of dynamic slicing are formulated in terms of the projection theory of slicing. This shows that existing forms of dynamic slicing contain three orthogonal dimensions in their slicing criteria and allows for a lattice-theo...
متن کاملDynamic program slicing methods
A dynamic program slice is this part of a program that "affects" the computation of a variable of interest during program execution on a specific program input. Dynamic program slicing refers to a collection of program slicing methods that are based on program execution and may significantly reduce the size of a program slice because run-time information, collected during program execution, is ...
متن کاملDynamic Program Slicing
A dynamic program slice is an executable subset of the original program that produces the same computations on a subset of selected variables and inputs. It differs from the static slice (Weiser, 1982, 1984) in that it is entirely defined on the basis of a computation. The two main advantages are the following: Arrays and dynamic data structures can be handled more precisely and the size of sli...
متن کاملConstructive Dynamic Program Slicing Research
Program slicing is a promising technique for providing automated support for various important software engineering activities. There exists hundreds of scientific studies on the theory of slicing. However, slicing is still not widely applied in software industry. Therefore, there is a need to survey and characterize the conducted research and to analyze what problems hinder progress. This pape...
متن کاملGraph theoretic foundations of program slicing and integration
This paper generalizes program slicing algorithms originally defined over representations of programs to operate over directed graphs. Doing so provides a uniform framework to model Weiser’s and Ottenstein & Ottenstein’s approaches to program slicing as abstract mathematical operations transparent of any concerns of a program’s structure or its semantics. This transparency helps us in a) derivi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2006
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2006.01.012